Soft ranking in clustering

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Soft ranking in clustering

Due to the diffusion of large-dimensional data sets (e.g., in DNA microarray or document organization and retrieval applications), there is a growing interest in clustering methods based on a proximity matrix. These have the advantage of being based on a data structure whose size only depends on cardinality, not dimensionality. In this paper we propose a clustering technique based on fuzzy rank...

متن کامل

Ranking Overlap and Outlier Points in Data using Soft Kernel Spectral Clustering

Soft clustering algorithms can handle real-life datasets better as they capture the presence of inherent overlapping clusters. A soft kernel spectral clustering (SKSC) method proposed in [1] exploited the eigen-projections of the points to assign them different cluster membership probabilities. In this paper, we detect points in dense overlapping regions as overlap points. We also identify the ...

متن کامل

Ranking and Clustering with Advice

There is a wide range of combinatorial optimisation problems which provide us with local, pairwise advice about data points, and then ask us to form a global clustering or ranking of those points. The objective is to maximise the amount of advice respected, or minimise the amount ignored. In this thesis, we study such problems from approximation and heuristic perspectives, as exact solutions ar...

متن کامل

Ranking and Clustering in Probabilistic Databases

The dramatic growth in the number of application domains that naturally generate probabilistic, uncertain data has resulted in a need for efficiently supporting complex querying and decision-making over such data. In this paper, we address the problem of on-the-fly clustering and ranking over probabilistic databases. We begin with a systematic exploration of ranking in probabilistic databases b...

متن کامل

Symmetrization: Ranking and Clustering in Protein Interfaces

Purely geometric arguments are used to extract information from three-dimensional structures of oligomeric proteins, that are very common biological entities stably made of several polypeptidic chains. They are characterized by the presence of an interface between adjacent amino acid chains and can be investigated with the approach proposed here. We introduce a method, called symmetrization, th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2009

ISSN: 0925-2312

DOI: 10.1016/j.neucom.2008.11.015